A Model-based Reasoning Approach to Circumscription

نویسندگان

  • Peter Fröhlich
  • Wolfgang Nejdl
چکیده

In this paper we show how model–based reasoning techniques can be used to solve circumscription entailment problems without computing the circumscription axiom. We characterize the circumscription by a small subset of the minimal models computed by a revision function. Using these models a filtering function decides, whether a given formula is entailed by the circumscription. We describe, how these functions can be efficiently implemented. Finally we demonstrate the power of our approach by applying it to current formalisms from the reasoning about action and change domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forward Human Reasoning Modeled by Logic Programming Modeled by Classical Logic with Circumscription and Projection

Recently an approach to model human reasoning as studied in cognitive science by logic programming, has been introduced by Stenning and van Lambalgen and exemplified with the suppression task. We investigate this approach from the view of a framework where different logic programming semantics correspond to different translations of logic programs into formulas of classical two-valued logic ext...

متن کامل

Circumscriptive Event Calculus as Answer Set Programming

Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, we show the opposite direction, which is, how to turn circumscription into the general stable model semantics, and based on this, how to turn circumscriptive event calculus into answ...

متن کامل

On the counting complexity of propositional circumscription

Propositional circumscription, asking for the minimal models of a Boolean formula, is an important problem in artificial intelligence, in data mining, in coding theory, and in the model checking based procedures in automated reasoning. We consider the counting problems of propositional circumscription for several subclasses with respect to the structure of the formula. We prove that the countin...

متن کامل

DRUM-II - efficient model-based diagnosis of technical systems

Diagnosis is one of the central application areas of artificial intelligence. The computation of diagnoses for complex technical systems which consist of several thousand components and exist in many different configurations is a grand challenge. For such systems it is usually impossible to directly deduce diagnoses from observed symptoms using empirical knowledge. Instead, the model–based appr...

متن کامل

Pointwise Circumscription: Preliminary Report

Circumscription is the minimization of predicates subject to restrictions expressed by predicate formulas. We propose a modified notion of circumscription so that, instead of being a single minimality condition, it becomes an “infinite conjun(*tion” of “local” minimality conditions; each of these conditions expresses the impbssibility of changing the value of a predicate from true to f&e at one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996